Interpreting a finitary pi-calculus in differential interaction nets

Interpreting a Finitary Pi-calculus in Differential Interaction Nets

Embedding the Finitary Pi-Calculus in Differential Interaction Nets

We propose a translation of a finitary (that is, replicationfree) version of the monadic localised pi-calculus into the purely exponential part of promotion-free differential interaction nets. This embedding is a simulation of reduction. Since the introduction of Linear Logic by Girard in 1986, it was clear to many logicians and computer scientists that some deep connection between this new log...

Pi-nets: interaction nets for pi-calculus

π-calculus is a framework that aims to describe concurrent calculations through a formal definition of processes. Originally, π-calculus is defined by a formal language and a set of reduction rules, much in the spirit of λ-calculus. Our aim is to provide a graphical representation of π-calculus using multi-wired interaction nets, in the spirit this time of proof-nets of linear logic. 1 π-calcul...

On differential interaction nets and the pi-calculus

We propose a translation of a finitary (that is, replication-free) version of the pi-calculus into promotionfree differential interaction net structures, a linear logic version of the differential lambda-calculus (or, more precisely, of a resource lambda-calculus). For the sake of simplicity only, we restrict our attention to a monadic version of the pi-calculus, so that the differential intera...

Pi Calculus Versus Petri Nets

In the context of Web Service Composition Languages (WSCLs), there is on ongoing debate on the best foundation for Process-Aware Information Systems (PAIS’s): Petri nets or Pi calculus. Example of PAIS’s are Workflow Management (WFM), Business Process Management (BPM), Business-to-Business (B2B), Customer Relationship Management (CRM), and Enterprise Resource Planning (ERP) systems. Clearly, th...